A two-dimensional mean problem
نویسندگان
چکیده
منابع مشابه
A simple approach to the two-dimensional guillotine cutting stock problem
Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a new, practical, rapid, and heuristic method was proposed for such problems. Then, the ...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملTwo-dimensional body of maximum mean resistance
A two-dimensional body, exhibiting a slight rotational movement, moves in a rarefied medium of particles which collide with it in a perfectly elastic way. In previously realized investigations by the first two authors, Plakhov & Gouveia (2007, Nonlinearity, 20), shapes of nonconvex bodies were sought which would maximize the braking force of the medium on their movement. Giving continuity to th...
متن کاملA two-dimensional problem of revenue maximization
We consider the problem of finding the mechanism that maximizes the revenue of a seller of multiple objects. This problem turns out to be significantlymore complex than the casewhere there is only a single object (which was solved by Myerson, 1981). The analysis is difficult even in the simplest case studied here, where there are two exclusive objects and a single buyer, with valuations uniform...
متن کاملMinimizing the Mean Tardiness in A N1 Sequencing Problem
This paper considers the problem of minimizing the mean tardiness of N jobs when the jobs are scheduled on a single machine. A simple algorithmic procedure is develop to obtain an optimal or a near optimal sequence for the N jobs while considering an equal penalty cost incurred to each job delivered later than its due date. The developed algorithm is applied to the several test problems. The re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1978
ISSN: 0021-9045
DOI: 10.1016/0021-9045(78)90067-9